Large growth factors in Gaussian elimination with pivoting
نویسندگان
چکیده
The growth factor plays an important role in the error analysis of Gaussian elimination. It is well known that when partial pivoting or complete pivoting is used the growth factor is usually small, but it can be large. The examples of large growth usually quoted involve contrived matrices that are unlikely to occur in practice. We present real and complex n n matrices arising from practical applications that, for any pivoting strategy, yield growth factors bounded below by n/2 and n, respectively. These matrices enable us to improve the known lower bounds on the largest possible growth factor in the case of complete pivoting. For partial pivoting, we classify the set of real matrices for which the growth factor is 2 Finally, we show that large element growth does not necessarily lead to a large backward error in the solution of a particular linear system, and we comment on the practical implications of this result.
منابع مشابه
Smoothed Analysis of Gaussian Elimination
We present a smoothed analysis of Gaussian elimination, both with partial pivoting and without pivoting. Let A be any matrix and let A be a slight random perturbation of A. We prove that it is unlikely that A has large condition number. Using this result, we prove it is unlikely that A has large growth factor under Gaussian elimination without pivoting. By combining these results, we bound the ...
متن کاملAverage - Case Stability of Gaussian Elimination 337
Gaussian elimination with partial pivoting is unstable in the worst case: the "growth factor" can be as large as 2"-l, where n is the matrix dimension, resulting in a loss of n bits of precision. It is proposed that an average-case analysis can help explain why it is nevertheless stable in practice. The results presented begin with the observation that for many distributions of matrices, the ma...
متن کاملComplete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملProbabilistic Analysis of Complex Gaussian Elimination without Pivoting
We consider Gaussian elimination without pivoting applied to complex Gaussian matrices X ∈ Cn×n. We first study some independence properties of the elements of the LU factors of X. Based on this, we then derive the probability distributions for all the L and U elements and obtain bounds for the probabilities of the occurrence of small pivots and large growth factors. Numerical experiments are p...
متن کاملStable Pivoting for the Fast Factorization of Cauchy-Like Matrices
Recent work by Sweet and Brent on the fast factorization of Cauchy-like matrices through a fast version of Gaussian elimination with partial pivoting has uncovered a potential stability problem which is not present in ordinary Gaussian elimination: excessive growth in the generators used to represent the matrix and its Schur complements can lead to large errors. A natural way to x this problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006